Hierarchical Bases for Nonhierarchic 3-D Triangular Meshes
نویسندگان
چکیده
منابع مشابه
An Efficient Volumetric Method for Building Closed Triangular Meshes from 3-D Image and Point Data
We present a volumetric method that can e ciently create triangular meshes from 3-D geometric data. This data can be presented in the form of images, pro les or unordered points. The mesh model can be created at di erent resolutions and can also be closed to make a true volumetric model.
متن کاملBases of Biquadratic Polynomial Spline Spaces over Hierarchical T-meshes
Basis functions of biquadratic polynomial spline spaces over hierarchical T-meshes are constructed. The basis functions are all tensor-product B-splines, which are linearly independent, nonnegative and complete. To make basis functions more efficient for geometric modeling, we also give out a new basis with the property of unit partition. Two preliminary applications are given to demonstrate th...
متن کاملGeometric Snakes for Triangular Meshes
Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In spite of much research in computer vision, automatic feature detection even for images still remains a difficult problem. To avoid this difficulty, semi-automatic or interactive techniques for image feature detection have been investigated. ...
متن کاملShape Blending between 3-d Triangular Meshes Based on Their Intrinsic Variables
Shape blending determines the in-between shapes that provide the gradual transformation of one shape into another. It is usually considered a two-step problem: the correspondence problem and the interpolation problem. This paper presents a solution to the interpolation of transforming one triangular mesh model into another triangular mesh based on their intrinsic definitions. Rather than consid...
متن کاملRay Tracing Triangular Meshes
This paper describes two approaches that allow us to intersect rays with triangular meshes more quickly by amortizing computation over neighbouring triangles. The first approach accomplishes this by performing the in-out test for each triangle using three plane equations, each one representing a boundary edge for the triangle. Each plane is shared between four neighbouring triangles and the cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Antennas and Propagation
سال: 2008
ISSN: 0018-926X
DOI: 10.1109/tap.2008.926756